If Mowat & Davis are Correct then Teaching is Hard
نویسندگان
چکیده
منابع مشابه
If intelligence is uncomputable , then ... *
I want to propose an abstract model of the human mind that is, to the human mind, a bit like what a Euclidean rectangle is to a farmers field. I want to show why intelligence, in this model, requires a particular kind of uncomputability the kind that Gold [2] has called computability in the limit. This observation has implications for Computer Science and Cognitive Science if my abstract mod...
متن کاملContinuous If-Then Statements Are Computable
In many practical situations, we must compute the value of an if-then expression f(x) defined as “if c(x) ≥ 0 then f+(x) else f−(x)”, where f+(x), f−(x), and c(x) are computable functions. The value f(x) cannot be computed directly, since in general, it is not possible to check whether a given real number c(x) is non-negative or non-positive. Similarly, it is not possible to compute the value f...
متن کاملHow good are fuzzy If-Then classifiers?
This paper gives some known theoretical results about fuzzy rule-based classifiers and offers a few new ones. The ability of Takagi-Sugeno-Kang (TSK) fuzzy classifiers to match exactly and to approximate classification boundaries is discussed. The lemma by Klawonn and Klement about the exact match of a classification boundary in R (2) is extended from monotonous to arbitrary functions. Equivale...
متن کاملFor Interval Computations, If Absolute-Accuracy Optimization is NP-Hard, Then So Is Relative-Accuracy Optimization
One of the basic problems of interval computations is to compute a range of a given function f(x1, . . . , xn) over a given box [x1 , x + 1 ]× . . .× [x − n , x + n ] (i.e., to compute the maximum and the minimum of the function on the box). For many classes of functions (e.g., for quadratic functions) this problem is NP-hard; it is even NP-hard if instead of computing the minimum and maximum e...
متن کاملImproving on Gutfreund, Shaltiel, and Ta-Shma's Paper "If NP Languages Are Hard on the Worst-Case, Then It Is Easy to Find Their Hard Instances"
Assume that NP 6= RP. Gutfreund, Shaltiel, and Ta-Shma in [Computational Complexity 16(4):412-441 (2007)] have proved that for every randomized polynomial time decision algorithm D for SAT there is a polynomial time samplable distribution such thatD errs with probability at least 1/6− ε on a random formula chosen with respect to that distribution. In this paper, we show how to increase the erro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complicity: An International Journal of Complexity and Education
سال: 2010
ISSN: 1710-5668,1710-5668
DOI: 10.29173/cmplct8840